Does the duration of silent pauses differ between words of open and closed class? A duração da pausa silente difere entre palavras de classe aberta ou fechada?

نویسندگان

  • Paula Renata Pedott
  • Letícia Bondezan Bacchin
  • Ana Manhani Cáceres-Assenço
  • Debora Maria Befi-Lopes
چکیده

Purpose: The study aim was to determine whether the mean duration of silent pauses depends on the word class (open or closed) and to compare the duration for each type of word between children with typical language development and children with specific language impairment (SLI). Methods: The study included 40 children with typical language development and 20 children with SLI, aged between 7 and 10 years. Each subject produced 15 story narratives based on a separate sequence of four pictures for each narrative. After the transcription of the samples, the words were classified as open class (noun, adjective, verb, adverb, and numeral) or closed class (article, preposition, pronoun, conjunction, and interjection). In the second phase of the study, the samples were analyzed using software specific to the analysis of silent pauses and the duration (milliseconds) of the pauses that occurred immediately before each of these grammatical categories was recorded. Results: In both groups, silent pauses were longer when preceding closed class words and individuals in the SLI group produced longer silent pauses than their peers did. Conclusion: The duration of a silent pause varied according to the grammatical class of the preceded word and it was shorter when followed by an open class word. In addition, the fact that individuals with SLI produce longer silent pauses than their peers confirms that their language processing is slower.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic anti-windup design for a class of nonlinear systems

This work addresses the dynamic anti-windup design problem for a class of nonlinear systems subject to actuator saturation. The considered class regards the systems that can be cast in a differentialalgebraic representation (DAR), such as rational and polynomial systems. Considering that a nonlinear dynamic output feedback controller, which can also be written as a DAR, has been designed to sta...

متن کامل

Extracção de relações semânticas entre palavras a partir de um dicionário: o PAPEL e a sua avaliação

Neste artigo apresentamos o PAPEL, um recurso lexical para o português, constitúıdo por relações entre palavras, extráıdas de forma automática de um dicionário da ĺıngua geral através da escrita manual de gramáticas para esse efeito. Depois de contextualizarmos o tipo de recurso e as opções tomadas, fornecemos uma visão do processo da sua construção, apresentando as relações inclúıdas e a sua q...

متن کامل

OntoSAIA: Um Ambiente Baseado em Ontologias para Recuperação e Anotação Semi-Automática de Imagens

This article proposes the use of image content, keywords and ontologies to improve the image annotation and retrieval processes through the enhancement of the user’s knowledge of an image database. It proposes an architecture of a flexible system capable of dealing with multiple ontologies and multiple image content descriptors to help these tasks. The validation of the idea is being done throu...

متن کامل

Reconhecimento de Palavras Manuscritas usando Modelos de Markov

This paper presents a handwriting recognition system that deals with unconstrained handwriting and large vocabularies. The system is based on a segmentation–recognition paradigm where words are first loosely segmented into characters and the final segmentation is obtained during the recognition process, which is driven by a lexicon. Characters are modeled by multiple hidden Markov models (HMMs)...

متن کامل

On Existentially First-Order Definable Languages and Their Relation to NP

Under the assumption that the Polynomial-Time Hierarchy does not collapse we show for a regular language L: the unbalanced polynomial-time leaf language class determined by L equals NP iff L is existentially but not quantifierfree definable in FO[<,min, max,+1,−1]. Furthermore, no such class lies properly between NP and co-1-NP or NP⊕co-NP. The proofs rely on a result of Pin and Weil characteri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014